Locating Hop Sets in a Graph
نویسندگان
چکیده
Let G be a connected graph with vertex set V (G) and edge E(G). The open hop neighborhood of v ∈ is the NG(v, 2) = {w : dG(v, w) 2}, where denotes distance between w. A non-empty S ⊆ locating if NG(u, ∩ ̸= for every pair distinct vertices u, \ S. smallest cardinality G, denoted by lhn(G) called number G. This study focuses mainly on concept in graphs. Characterizations sets join corona two graphs are given bounds corresponding numbers these determined.
منابع مشابه
Different-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملLocating a robber on a graph
Consider the following game of a cop locating a robber on a connected graph. At each turn, the cop chooses a vertex of the graph to probe and receives the distance from the probe to the robber. If she can uniquely locate the robber after this probe, then she wins. Otherwise the robber may either stay put or move to any vertex adjacent to his location other than the probe vertex. The cop’s goal ...
متن کاملDecision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
An identifying code is a subset of vertices of a graph with the property that each vertex is uniquely determined (identified) by its nonempty neighbourhood within the identifying code. When only vertices out of the code are asked to be identified, we get the related concept of a locating-dominating set. These notions are closely related to a number of similar and well-studied concepts such as t...
متن کاملOpen neighborhood locating dominating sets
For a graph G that models a facility, various detection devices can be placed at the vertices so as to identify the location of an intruder such as a thief or saboteur. Here we introduce the open neighborhood locating-dominating set problem. We seek a minimum cardinality vertex set S with the property that for each vertex v its open neighborhood N(v) has a unique non-empty intersection with S. ...
متن کاملLocating-dominating sets in twin-free graphs
A locating-dominating set a of graph G is a dominating set D of G with the additional property that every two distinct vertices outside D have distinct neighbors in D; that is, for distinct vertices u and v outside D, N(u) ∩D 6= N(v) ∩D where N(u) denotes the open neighborhood of u. A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. The location-dom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Pure and Applied Mathematics
سال: 2022
ISSN: ['1307-5543']
DOI: https://doi.org/10.29020/nybg.ejpam.v15i4.4500